#include"AVLtree.h"
int main()
{
	//int a[] = { 16,3,7,11,9,26,18,14,15 };
	vector<int> arr;
	const int N = 10000;
	arr.reserve(N);
	srand(time(0));
	for (int i = 0; i < N; i++)
	{
		arr.push_back(rand());
	}
	AVLTree<int, int> t;
	for (auto ch : arr)
	{
		t.Insert(make_pair(ch, ch));
		//cout << "Insert:" << ch << "->" << t.IsBalance() << endl;
	}
	cout << t.IsBalance();
	return 0;
}